Fully sincere voting

نویسنده

  • Alexander Wolitzky
چکیده

In a general social choice framework where the requirement of strategyproofness may not be sensible, we call a social choice rule fully sincere if it never gives any individual an incentive to vote for a less-preferred alternative over a more-preferred one and provides an incentive to vote for an alternative if and only if it is preferred to the default option that would result from abstaining. If the social choice rule can depend only on the number of votes that each alternative receives, those rules satisfying full sincerity are convex combinations of the rule that chooses each alternative with probability equal to the proportion of the vote it receives and an arbitrary rule that ignores voters’preferences. We note a sense in which the natural probabilistic analog of approval voting is the fully sincere rule that allows voters maximal ‡exibility in expressing their preferences and gives these preferences maximal weight. JEL classi…cation : D70

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voluntary voting: Costs and benefits

We compare voluntary and compulsory voting in a Condorcet-type model in which voters have identical preferences but differential information. With voluntary voting, all equilibria involve sincere voting and positive participation. Thus, in contrast to situations with compulsory voting, there is no conflict between strategic and sincere behavior. When voting is costless, voluntary voting is welf...

متن کامل

Commitee decisions: optimality and equilibrium

We consider a committee facing a binary decision under uncertainty. Each member holds some private information. Members may have different preferences and initial beliefs, but they all agree which decision should be taken in each of the two states of the world. We characterize the optimal anonymous and deterministic voting rule and provide a homogeneity assumption on preferences and beliefs und...

متن کامل

Control Complexity in Fallback Voting

We study the control complexity of fallback voting. Like manipulation and bribery, electoral control describes ways of changing the outcome of an election; unlike manipulation or bribery attempts, control actions—such as adding/deleting/partitioning either candidates or voters— modify the participative structure of an election. Via such actions one can try to either make a favorite candidate wi...

متن کامل

Iterated Regret Minimization in Voting Games

The game-theoretic solution concept Iterated Regret Minimization (IRM) was introduced recently by Halpern and Pass. We give the first application of IRM to simultaneous voting games. We study positional scoring rules in detail and give theoretical results demonstrating the bias of IRM toward sincere voting. We present comprehensive simulation results of the effect on social welfare of IRM compa...

متن کامل

Does uncertainty lead to sincerity? Simple and complex voting mechanisms

We ask whether the absence of information about other voters’ preferences allows optimal voting to be interpreted as sincere. We start by classifying voting mechanisms as simple and complex according to the number of message types voters can use to elect alternatives. We show that while the elimination of information about other voters’ preferences allows optimal voting to be interpreted as sin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 67  شماره 

صفحات  -

تاریخ انتشار 2009